Some set intersection theorems of extremal type
نویسنده
چکیده
For a family F of sets, let ex(F) := {A : A is an extremal intersecting sub-family of F}. The Erd®s-Ko-Rado (EKR) Theorem states that {A ∈ ( [n] r ) : 1 ∈ A} ∈ ex( ( [n] r ) ) if r ≤ n/2. The Hilton-Milner (HM) Theorem states that if r ≤ n/2 and A is a nontrivial intersecting sub-family of ( [n] r ) then |A| ≤ |{A ∈ ( [n] r ) : 1 ∈ A,A ∩ [2, r + 1] 6= ∅} ∪ {[2, r + 1]}|; hence {{A ∈ ( [n] r ) : j ∈ A} : j ∈ [n]} = ex( ( [n] r ) ) if r < n/2. Thus we say that a family F is (strictly) EKR if ex(F) contains (only) trivial intersecting families. We obtain a partial solution to the following problem: for r ≤ n/2, which sets Z ⊆ [n] have the property that |{A ∈ A : A∩Z 6= ∅}| ≤ |{A ∈ ( [n] r ) : 1 ∈ A,A∩Z 6= ∅}| for all compressed intersecting sub-families of ( [n] r ) ? Using the idea of this problem, we generalise the HM Theorem to a setting of compressed hereditary families. For a set X := {x1, ..., x|X|}, we de ne the family SX,k of signed sets by SX,k := {{(x1, a1), ..., (x|X|, a|X|)} : a1, ..., a|X| ∈ [k]} and the sub-family S∗ X,k by S∗ X,k := {{(x1, a1), ..., (x|X|, a|X|)} : {a1, ..., a|X|} ∈ ( [k] |X| ) }. For a family F , let SF ,k := ⋃ F∈F SF,k, S∗ F ,k := ⋃
منابع مشابه
Extremal Set Systems with Weakly Restricted Intersections
Theorems on extremal set systems with intersections of restricted cardinality are probably among the most well-known and powerful theorems in extremal combinatorics. In this paper, we discuss the so-call ”weak” version of some theorems of this type, when the restricted intersection property is weakened by the possible existence of some (maybe many) intersections having ”bad” sizes. In particula...
متن کاملIntersection Theorems for Finite Sets and Geometric Applications
1. Introduction. Let X be an n-element set and F C 2 X a family of distinct subsets of X. Suppose that the members of F satisfy some conditions. What is the maximum (or minimum) value of |F|—this is the generic problem in extremal set theory. There have been far too many papers and results in this area to be overviewed in such a short paper. Therefore, we will only deal with some intersection t...
متن کاملIntersection theorems and mod p rank of inclusion matrices
Higher incidence matrices have proved an important tool both in design theory and extremal set theory. In the present paper some tight bounds on the rank over finite fields of some inclusion matrices are derived. In particular, a short proof of Wilson's mod p rank formula is given. A problem of Graham, Li, and Li concerning bases for so-called null t-designs is solved as well.
متن کاملProblems and Results on Intersections of Set Systems of Structural Type
The study of intersection theorems for set systems was started in the papers of [BE 1] and [EKR 1] . In the last twenty years a fairly extended theory has developed, several survey papers [EK 1], [K] were written . There is also a forthcoming book [FFK 1] about extremal problems of set systems . Intersection theorems of structural type started in the papers of [SS 1] were followed by several ot...
متن کاملIntersection Properties of Subsets of Integers
Intersection properties of sets have been widely investigated by many authors. One type of theorems proved for them has the following form [9]. Let S be an n-element set and AI. ... , AN £ S, 1 £ [1, n]. Assume that IAi I1Ajl E 1 for 1,,;;;; i <j ,,;;;;N. How large can N be under this condition, depending on n and I? Thus, e.g., the de Bruijn-Erdos theorem [1] asserts that if IAi I1Ajl = 1 for ...
متن کاملLinear independence, a unifying approach to shadow theorems
The intersection shadow theorem of Katona is an important tool in extremal set theory. The original proof is purely combinatorial. The aim of the present paper is to show how it is using linear independence latently.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008